全文获取类型
收费全文 | 367篇 |
免费 | 8篇 |
出版年
2021年 | 4篇 |
2019年 | 7篇 |
2018年 | 11篇 |
2017年 | 8篇 |
2016年 | 11篇 |
2015年 | 2篇 |
2014年 | 7篇 |
2013年 | 105篇 |
2012年 | 2篇 |
2011年 | 3篇 |
2010年 | 6篇 |
2009年 | 5篇 |
2008年 | 4篇 |
2006年 | 4篇 |
2005年 | 8篇 |
2004年 | 4篇 |
2003年 | 6篇 |
2002年 | 9篇 |
2001年 | 4篇 |
2000年 | 6篇 |
1999年 | 5篇 |
1998年 | 3篇 |
1997年 | 8篇 |
1995年 | 3篇 |
1993年 | 2篇 |
1992年 | 2篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1987年 | 6篇 |
1986年 | 9篇 |
1985年 | 10篇 |
1984年 | 10篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 3篇 |
1980年 | 5篇 |
1979年 | 6篇 |
1978年 | 9篇 |
1977年 | 6篇 |
1976年 | 4篇 |
1975年 | 2篇 |
1974年 | 9篇 |
1972年 | 5篇 |
1971年 | 10篇 |
1970年 | 5篇 |
1969年 | 7篇 |
1968年 | 3篇 |
1967年 | 3篇 |
1966年 | 2篇 |
排序方式: 共有375条查询结果,搜索用时 15 毫秒
1.
2.
The production-location problem of a profit maximizing firm is considered. A model is developed for a single firm, facing the joint problems of determining the optimal plant location, the optimal input mix, and the optimal plant size. A homothetic production function is used as the model of the production technologies, and the existence of a sequential “separability” between the production, or input mix, problem and the location problem is demonstrated. 相似文献
3.
4.
5.
John R. McNamara 《海军后勤学研究》1986,33(3):501-512
A posynomial geometric programming problem formulated so that the number of objective function terms is equal to the number of primal variables will have a zero degree of difficulty when augmented by multiplying each constraint term by a slack variable and including a surrogate constraint composed of the product of the slack variables, each raised to an undetermined negative exponent or surrogate multiplier. It is assumed that the original problem is canonical. The exponents in the constraint on the product of the slack variables must be estimated so that the associated solution to the augmented problem, obtained immediately, also solves the original problem. An iterative search procedure for finding the required exponents, thus solving the original problem, is described. The search procedure has proven quite efficient, often requiring only two or three iterations per degree of difficulty of the original problem. At each iteration the well-known procedure for solving a geometric programming problem with a zero degree of difficulty is used and so computations are simple. The solution generated at each iteration is optimal for a problem which differs from the original problem only in the values of some of the constraint coefficients, so intermediate solutions provide useful information. 相似文献
6.
7.
This article considers an inventory model with constant demand and stochastic lead times distributed over a finite range. A generalization of the EOQ formula with backorders is derived and ranges for the decision variables are obtained. The results are illustrated with the case of uniformly distributed lead time. 相似文献
8.
9.
An allocation problem is considered in lvhich different kinds of resources must be allocated to various activities, within a given time period. The opportunities for allo'cation appear randomly during this period. Certain assumptions about the values of possible allocations and the distribution of occurrences of opportunities lead to a dynamic programming formulation of the problem. This leads to a system of ordinary differential equations which are (in theory) solvable recursively, and can be solved numerically to any desired degree of precision. An example is given for the allocation of aircraft-carried weapons to targets of opportunity. 相似文献
10.